Permutations with interval cycles

نویسندگان

  • Arnold Knopfmacher
  • Augustine O. Munagi
چکیده

We study permutations of the set [n] = {1, 2, . . . , n} written in cycle notation, for which each cycle forms an increasing or decreasing interval of positive integers. More generally, permutations whose cycle elements form arithmetic progressions are considered. We also investigate the class of generalised interval permutations, where each cycle can be rearranged in increasing order to form an interval of consecutive positive integers.. 1 Interval Permutations The partitions of the set [n] = {1, 2, . . . , n} into k nonempty subsets of consecutive integers are enumerated by ( n−1 k−1 ) since this is the number of ways of inserting k − 1 separators between the sequence of numbers 1, 2, . . . , n, 1 ≤ k ≤ n. We will obtain analogous results for permutations of [n], written in the cycle notation. Taking different orderings of the elements of the cycles into account gives several different analogues of the set partition case. Firstly, a permutation p of [n] will be called an interval permutation if every cycle of p consists of one increasing or decreasing sequence of consecutive integers. Even though the standard notation places the least member of a cycle in the first position, we adopt the convention to reckon only with the permutations in which the members of a cycle have been shifted so as to exhibit the maximal number of pairs of consecutive integers. An interval permutation is the unique member of its cycle class in which every v-cycle consists of v increasing or decreasing consecutive integers. Later in Section 5 we will also study the class of generalised interval permutations, where each cycle can be rearranged in increasing order to form an interval of consecutive integers. Denote the set of interval permutations of [n] with k cycles (also kpermutations below) by R(n, k), and let r(n, k) = |R(n, k)|. Also let r(n) = r(n, 1) + r(n, 2) + · · ·+ r(n, n).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Number of Cycles of Specified Normalized Length in Permutations

We compute the limiting distribution, as n → ∞, of the number of cycles of length between γn and δn in a permutation of [n] chosen uniformly at random, for constants γ, δ such that 1/(k + 1) ≤ γ < δ ≤ 1/k for some integer k. This distribution is supported on {0, 1, . . . , k} and has 0th, 1st, ..., kth moments equal to those of a Poisson distribution with parameter log δ γ . For more general ch...

متن کامل

Cycle Structure of Riie Shuues

A class of models for riie shuues (\f?shuues") related to certain expansive map-pings of the unit interval is studied. The main results concern the cycle structure of the resulting random permutations in S n when n is large. The rst result describes the asymptotic distribution of the number of cycles of a given length, relating this distribution to dynamical properties of the associated mapping...

متن کامل

Universal cycles for permutations

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n + 1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham.

متن کامل

Restricted compositions and permutations: From old to new Gray codes

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of ≺ to the set of compositions and bounded compositio...

متن کامل

3 1 Ju l 2 00 6 Permutations , cycles , and the pattern 2 – 13

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ars Comb.

دوره 105  شماره 

صفحات  -

تاریخ انتشار 2012